A canonical form for positive definite matrices
نویسندگان
چکیده
منابع مشابه
Riemannian Sparse Coding for Positive Definite Matrices
Inspired by the great success of sparse coding for vector valued data, our goal is to represent symmetric positive definite (SPD) data matrices as sparse linear combinations of atoms from a dictionary, where each atom itself is an SPD matrix. Since SPD matrices follow a non-Euclidean (in fact a Riemannian) geometry, existing sparse coding techniques for Euclidean data cannot be directly extende...
متن کاملDeterminantal inequalities for positive definite matrices
Let Ai , i = 1, . . . ,m , be positive definite matrices with diagonal blocks A ( j) i , 16 j 6 k , where A ( j) 1 , . . . ,A ( j) m are of the same size for each j . We prove the inequality det( m ∑ i=1 A−1 i ) > det( m ∑ i=1 (A (1) i ) −1) · · ·det( m ∑ i=1 (A (k) i ) −1) and more determinantal inequalities related to positive definite matrices.
متن کاملDDtBe for Band Symmetric Positive Definite Matrices
We present a new parallel factorization for band symmetric positive definite (s.p.d) matrices and show some of its applications. Let A be a band s.p.d matrix of order n and half bandwidth m. We show how to factor A as A =DDt Be using approximately 4nm2 jp parallel operations where p =21: is the number of processors. Having this factorization, we improve the time to solve Ax = b by a factor of m...
متن کاملA Trace Bound for Positive Definite Connected Integer Symmetric Matrices
Let A be a connected integer symmetric matrix, i.e., A = (aij) ∈ Mn(Z) for some n, A = AT , and the underlying graph (vertices corresponding to rows, with vertex i joined to vertex j if aij 6= 0) is connected. We show that if all the eigenvalues of A are strictly positive, then tr(A) ≥ 2n− 1. There are two striking corollaries. First, the analogue of the Schur-SiegelSmyth trace problem is solve...
متن کاملA robust incomplete factorization preconditioner for positive definite matrices
We describe a novel technique for computing a sparse incomplete factorization of a general symmetric positive de nite matrix A. The factorization is not based on the Cholesky algorithm (or Gaussian elimination), but on A-orthogonalization. Thus, the incomplete factorization always exists and can be computed without any diagonal modi cation. When used in conjunction with the conjugate gradient a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Book Series
سال: 2020
ISSN: 2329-907X,2329-9061
DOI: 10.2140/obs.2020.4.179